Impossibility of Classically Simulating One-Clean-Qubit Computation
نویسندگان
چکیده
Tomoyuki Morimae, ∗ Harumichi Nishimura, † Keisuke Fujii, 4, ‡ and Shuhei Tamate 6, § ASRLD Unit, Gunma University, 1-5-1 Tenjin-cho Kiryu-shi Gunma-ken, 376-0052, Japan 2 Graduate School of Information Science, Nagoya University, Chikusa-ku, Nagoya, Aichi, 464-8601, Japan The Hakubi Center for Advanced Research, Kyoto University, Yoshida-Ushinomiya-cho, Sakyo-ku, Kyoto 606-8302, Japan Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan RIKEN Center for Emergent Matter Science, Wako-shi, Saitama 351-0198, Japan National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan (Dated: September 25, 2014)
منابع مشابه
Estimating Jones polynomials is a complete problem for one clean qubit
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model[12, 3, 1]. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be stri...
متن کاملOn the hardness of classically simulating the one clean qubit model
Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently...
متن کاملHardness of classically sampling one clean qubit model with constant total variation distance error
Abstract The one clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single input qubit is pure and all other input qubits are maximally mixed. In spite of the severe restriction, the model can solve several problems (such as calculating Jones polynomials) whose classical efficient solutions are not known. Furthermore, it was shown that if the output pr...
متن کاملQuantum Information Cannot Be Split into Complementary Parts
We prove a new impossibility for quantum information (the no-splitting theorem): an unknown quantum bit (qubit) cannot be split into two complementary qubits. This impossibility, together with the no-cloning theorem, demonstrates that an unknown qubit state is a single entity, which cannot be cloned or split. This sheds new light on quantum computation and quantum information.
متن کاملEstimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.6777 شماره
صفحات -
تاریخ انتشار 2014